Optimal Sequential Vector Quantization of Markov Sources
نویسندگان
چکیده
منابع مشابه
Optimal Sequential Vector Quantization of Markov Sources
The problem of sequential vector quantization of a stationary Markov source is cast as an equivalent stochastic control problem with partial observations. This problem is analyzed using the techniques of dynamic programming, leading to a characterization of optimal encoding schemes.
متن کاملOptimal Sequential Vector Quantization of Markov Sources - Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
The problem of optimal sequential vector quantization of Markov sources is cast as a stochastic control problem wi th partial observations and constraints, leading to useful existence results for optimal codes and their characterizations.
متن کاملSequential Coding of Gauss–Markov Sources
We consider the problem of sequential transmission of Gauss–Markov sources. We show that in the limit of large spatial block lengths, greedy compression with respect to the squared error distortion is optimal; that is, there is no tension between optimizing the distortion of the source in the current time instant and that of future times. We then extend this result to the case where at time t a...
متن کاملOptimal Re - quantization Vector Quantization with Wavelet Transformation
To enhance the signal quality based on optimization techniques, a scheme based on 9/7 wavelet transform and an optimal re-quantization codebook proposed. The optimal requantization codebook is constructed by an iterative manner for a given quantization codebook that was originally constructed based on the quantization codebook of the specified transmitter. The construction process is iterativel...
متن کاملFast sequential implementation of "neural-gas" network for vector quantization
Although the “neural-gas” network proposed by Martinetz et al. in 1993 has been proven for its optimality in vector quantizer design and has been demonstrated to have good performance in time-series prediction, its high computational complexity (N logN) makes it a slow sequential algorithm. In this letter, we suggest two ideas to speedup its sequential realization: 1) using a truncated exponent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Control and Optimization
سال: 2001
ISSN: 0363-0129,1095-7138
DOI: 10.1137/s0363012999365261